Decomposed Arbiters for Large Crossbars with Multi-Queue Input Buffers
نویسندگان
چکیده
Crossbars are key components of communication switches used to construct multiprocessor interconnection networks. For a fixed number of nodes, larger crossbars result in reduced probability of conflicts and allows packets to traverse the network in fewer hops. However, increasing the size of the crossbar also increases the delay of the arbiter used to resolve conflicting requests. The increased arbitration delay can lead to overall poor network performance. The impact of the increased arbitration delay can be mitigated by decomposing the arbitration process into multiple steps, such that some requests can be granted before the arbitration of the entire crossbar is complete. This paper deals with the design of such decomposed arbiters for large crossbars. The focus is on crossbars with multi-queue buffers at their inputs. Such buffers have been shown to provide significantly higher performance than conventional FIFO buffers.
منابع مشابه
Starvation Prevention for Arbiters of Crossbars with Multi-Queue Input Buffers
Crossbars are key components of communication switches used to construct multiprocessor interconnection networks. Multi-queue input buffers have been shown to lead to high performance in such networks by allowing packets at an input port to be processed in non-FIFO order. Symmetric crossbar arbiters efficiently resolve conflicting requests in switches with multi-queue input buffers. While these...
متن کاملA Practical Deterministic Crossbar Scheduler Achieves Almost Full Throughput without Being Heavily Affected by Short Virtual Output Queues Or
......Input-queued crossbars are the common building blocks in Internet routers, datacenter and high-performance computing interconnects, and on-chip networks. These crossbars often contain no buffers, which saves valuable chip area. Arriving packets issue requests to a central scheduler. While waiting for the scheduler to grant their requests, packets wait at input packet buffers in front of t...
متن کاملA Practical Deterministic Crossbar Scheduler Achieves Almost Full Throughput without Being Heavily Affected by Short Virtual Output Queues or Traffic Burstiness. Simple Additions Offer Deterministic Service Guarantees and Distribute the Bandwidth of Congested Links in a Weighted, Fair Manner
......Input-queued crossbars are the common building blocks in Internet routers, datacenter and high-performance computing interconnects, and on-chip networks. These crossbars often contain no buffers, which saves valuable chip area. Arriving packets issue requests to a central scheduler. While waiting for the scheduler to grant their requests, packets wait at input packet buffers in front of t...
متن کاملEfficient Queuing Architecture for a Buffered Crossbar Switch
This paper presents a modified architecture for a buffered crossbar switch that overcomes the memory bottleneck with only a minor impact on performance. The proposed architecture uses two levels of backpressure with different constraints on round trip time. Buffered crossbars are considered an alternative to bufferless crossbars mainly because the latter requires a complex scheduling algorithm ...
متن کاملStrong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Until recently, such performance guarantees have only been developed for crossbars that switch cells rather t...
متن کامل